Signed-bit representations of real numbers
نویسندگان
چکیده
The signed-bit representation of real numbers is like the binary representation, but in addition to 0 and 1 you can also use −1. It lends itself especially well to the constructive (intuitionistic) theory of the real numbers. The first part of the paper develops and studies the signed-bit equivalents of three common notions of a real number: Dedekind cuts, Cauchy sequences, and regular sequences. This theory is then applied to homomorphisms of Riesz spaces into R.
منابع مشابه
Coinductive Proofs for Basic Real Computation
We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these two representations to show the adequacy of signed digit stream representation. We also show a coinductive proof for the correctness of a corecursive program for the average function with regard to the signed digit stre...
متن کاملضربکننده و ضربجمعکننده پیمانه 2n+1 برای پردازنده سیگنال دیجیتال
Nowadays, digital signal processors (DSPs) are appropriate choices for real-time image and video processing in embedded multimedia applications not only due to their superior signal processing performance, but also of the high levels of integration and very low-power consumption. Filtering which consists of multiple addition and multiplication operations, is one of the most fundamental operatio...
متن کاملA coinductive approach to computing with compact sets
Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first author it was shown how to extract certified algorithms working with the signed digit representations from constructive proofs. In this paper we lay the found...
متن کاملMultiplication of Signed-digit Numbers
A recently proposed technique for common-multiplicand multiplication of binary numbers is shown to be applicable to signed-digit numbers. We prove that multiplication of a single k-bit multiplicand by n k-bit multipliers can be performed using 0:306nk additions for canonically recoded signed-digit numbers, while the binary case requires 0:375nk additions.
متن کاملA signed binary multiplication technique pdf
Bit is added to the left of the partial product using sign extension.products required to half that required by a simple add and shift method. A signed binary multiplication technique. Quarterly Journal of.Booths multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in twos complement notation. The above mentioned technique is inadequate when the multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Logic & Analysis
دوره 1 شماره
صفحات -
تاریخ انتشار 2009